A Simulation Study on the Strong Neighborhood-based Stable Connected Dominating Sets for Mobile Ad Hoc Networks

نویسندگان

  • Natarajan Meghanathan
  • Michael Terrell
چکیده

We present a detailed simulation based performance study of our recently proposed strong-neighborhood based connected dominating sets (SN-CDS) for mobile ad hoc networks (MANETs). We compare the performance of SN-CDS with that of the well-known minimum connected dominating sets (MCDS) and the ID-based connected dominating sets (ID-CDS) for MANETs. We show that by computing the SN-CDS involving links that are only within 90% of the maximum transmission range of the nodes, we are able to significantly improve the stability of the CDS (as large as 250%), compared to the MCDS strategy of choosing the minimum number of nodes to cover the entire network. An SN-CDS requires only at most 20% more nodes and has the potential to consume only at most 25% more energy compared to that of a MCDS. On the other hand, the ID-CDS requires 40-70% more nodes and has the potential to consume as large as 140% more energy compared to that of a MCDS. The diameter of an SN-CDS is at most 10% more than that of a MCDS, and the hop count per source-destination path (between any two randomly chosen network nodes) involving the CDS nodes as intermediate nodes is about the same for both the SNCDS and MCDS. Thus, the SN-CDS effectively balances the stability-node size tradeoff and is significantly more stable than that of a MCDS, only at the cost of a minimal to moderate increase in the other performance metrics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm to Determine Stable Connected Dominating Sets for Mobile Ad hoc Networks using Strong Neighborhoods

We propose an algorithm to determine stable connected dominating sets (CDS) for mobile ad hoc networks using the notion of strong neighborhood (SN). The SN-CDS algorithm takes an input parameter called the Threshold Neighborhood Distance Ratio (TNDR); for an edge to be part of a strong neighborhood-based topology, the ratio of the physical Euclidean distance between the end nodes of the edge to...

متن کامل

Estimating Reliability in Mobile ad-hoc Networks Based on Monte Carlo Simulation (TECHNICAL NOTE)

Each system has its own definition of reliability. Reliability in mobile ad-hoc networks (MANET) could be interpreted as, the probability of reaching a message from a source node to destination, successfully. The variability and volatility of the MANET configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate. It is because, no single structure or configurat...

متن کامل

Distributed Construction of Weakly Connected Dominating Sets for Clustering Mobile Ad Hoc Networks

Weakly connected dominating set (WCDS) has been proposed to cluster mobile ad hoc networks and be used as a virtual backbone. There have been some distributed approximation algorithms proposed in the literature for minimum WCDS. But none of them have constant approximation factors. Thus these algorithms can not guarantee to generate a WCDS of small size. Their message complexities may also be a...

متن کامل

An enhanced approach to determine connected dominating sets for routing in mobile ad hoc networks

A mobile ad hoc network is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralised administration. Mobile ad hoc networks face a lot of challenges for designing a scalable routing protocol due to their natural characteristics. The IDea of virtual backbone routing has been proposed for efficient routing in mobile ad h...

متن کامل

Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links

Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012